System and method for performing a multiple pass search

ABSTRACT

A method including the steps of: receiving a search query; executing a first search pass of a conditional search flow pipeline according to a first configuration; generating and storing information based on the executed first search pass as search context information; determining which search pass of the conditional search flow pipeline should be executed as a second search pass based on a transition rule associated with the first search pass and the search context information; executing the second search pass of the conditional search flow pipeline according to a second configuration; generating additional information based on the executed second search pass; updating the search context information based on the additional information; and determining whether to provide updated search context information or proceed to another search pass of the conditional search flow pipeline based on a transition rule associated with the second search pass and the updated search context information.

FIELD OF THE INVENTION

The present invention generally relates to systems and methods forsearching a database, and more particularly, the present inventionrelates to systems and methods for a search engine adaptable for anelectronic commerce website to perform multiple context dependent searchpasses to generate search results.

SUMMARY OF THE INVENTION

Systems and methods for performing multiple context dependent searchpasses are provided.

A method according to an exemplary embodiment of the present inventioncomprises the steps of: receiving, using one or more processors, asearch query containing search terms; executing, using one or moreprocessors, a first search pass of a conditional search flow pipelineaccording to a first search pass configuration in response to thereceived search query; generating, using one or more processors, searchresults and associated information based on the executed first searchpass; storing, using one or more processors, the search results andassociated information obtained from the execution of the first searchpass as search context information; determining, using one or moreprocessors, which search pass of the conditional search flow pipelineshould be executed as a second search pass based on a transition ruleassociated with the first search pass and the search contextinformation; executing, using one or more processors, the second searchpass of the conditional search flow pipeline according to a secondsearch pass configuration in response to the received search query;generating, using one or more processors, additional search results andassociated information based on the executed second search pass;updating, using one or more processors, the search context informationbased on the additional search results and associated informationobtained from the execution of the second search pass; and determining,using one or more processors, whether to provide updated search resultsin the updated search context information or proceed to another searchpass of the conditional search flow pipeline based on a transition ruleassociated with the second search pass and the updated search contextinformation.

In an exemplary embodiment, the search context information comprises oneor more implicit refinement constraints.

In an exemplary embodiment, the method further comprises the step ofapplying one or more implicit refinement constraints during execution ofthe first or second search pass.

In an exemplary embodiment, the step of updating the search contextinformation is further based on the transition rule associated with thefirst search pass.

In an exemplary embodiment, the step of updating the search contextinformation comprises storing the additional search results generated bythe second search pass.

In an exemplary embodiment, the step of updating the search contextinformation comprises discarding the search results generated by thefirst search pass.

A method according to an exemplary embodiment of the present inventioncomprises the steps of: receiving, using one or more processors,configuration parameters for one or more electronic search passes;receiving, using one or more processors, parameters related totransition rules for the one or more electronic search passes; storing,using one or more processors, the configuration parameters and theparameters related to the transition rules for the one or moreelectronic search passes in a configuration file; generating, using oneor more processors, a conditional search flow pipeline from theconfiguration file to be executed by an electronic search engine module.

In an exemplary embodiment, the configuration parameters compriseindication of whether implicit refinements should be applied.

In an exemplary embodiment, the parameters related to a transition rulecomprise identification of a transition path and one or more transitionconditions associated with the transition path.

In an exemplary embodiment, the parameters related to a transition rulecomprise indication of whether search results of an electronic searchpass should be merged into or replaced by search results of anotherelectronic search pass.

A system according to an exemplary embodiment of the present inventioncomprises: at least one processor; at least one non-transitory processorreadable medium operatively connected to at least one processor, the atleast one processor readable medium having processor readableinstructions executable by the at least one processor to perform thefollowing method: receiving, using one or more processors, a searchquery containing search terms; executing, using one or more processors,a first search pass of a conditional search flow pipeline according to afirst search pass configuration in response to the received searchquery; generating, using one or more processors, search results andassociated information based on the executed first search pass; storing,using one or more processors, the search results and associatedinformation obtained from the execution of the first search pass assearch context information; determining, using one or more processors,which search pass of the conditional search flow pipeline should beexecuted as a second search pass based on a transition rule associatedwith the first search pass and the search context information;executing, using one or more processors, the second search pass of theconditional search flow pipeline according to a second search passconfiguration in response to the received search query; generating,using one or more processors, additional search results and associatedinformation based on the executed second search pass; updating, usingone or more processors, the search context information based on theadditional search results and associated information obtained from theexecution of the second search pass; and determining, using one or moreprocessors, whether to provide updated search results in the updatedsearch context information or proceed to another search pass of theconditional search flow pipeline based on a transition rule associatedwith the second search pass and the updated search context information.

A system according to an exemplary embodiment of the present inventioncomprises: at least one processor; at least one non-transitory processorreadable medium operatively connected to at least one processor, the atleast one processor readable medium having processor readableinstructions executable by the at least one processor to perform thefollowing method: receiving, using one or more processors, configurationparameters for one or more electronic search passes; receiving, usingone or more processors, parameters related to transition rules for theone or more electronic search passes; storing, using one or moreprocessors, the configuration parameters and the parameters related tothe transition rules for the one or more electronic search passes in aconfiguration file; generating, using one or more processors, aconditional search flow pipeline from the configuration file to beexecuted by an electronic search engine module.

These and other features of this invention are described in, or areapparent from, the following detailed description of various exemplaryembodiments of this invention.

BRIEF DESCRIPTION OF THE DRAWINGS

The features and advantages of the present invention will be more fullyunderstood by reference to the following detailed description ofillustrative embodiments of the present invention when taken inconjunction with the following figures, wherein:

FIG. 1 is a schematic diagram of a multiple pass search engine serversystem in accordance with exemplary embodiments of the presentinvention;

FIG. 2 is a flow chart of a process for a multiple pass search inaccordance with exemplary embodiments of the present invention;

FIG. 3 is a flow chart of a process for a general multiple pass searchin accordance with exemplary embodiments of the present invention;

FIG. 4 is a flow chart of a process for configuring a multiple passsearch in accordance with exemplary embodiments of the presentinvention;

FIG. 5 is a flow chart of a process for configuring a search pass of amultiple pass search in accordance with exemplary embodiments of thepresent invention; and

FIG. 6 is a chart showing different types of match strategies that canbe implemented in a search pass, organized along two axes.

DETAILED DESCRIPTION

In determining search results, such as search results for akeyword-based product search query on an electronic commerce website, itis important to produce search results that are comprehensive yetrelevant to the query.

Typically, in a keyword-based product search query there exists atrade-off between precision (portion of products in the returned resultsthat are relevant among all returned results) and recall (portion ofrelevant products returned among all relevant products in the database).Achieving 100% precision for every search result is impractical. On theother hand, achieving 100% recall is easily accomplished by returningthe entire product catalog, but the precision of such a search resultwill be poor. Administrators for electronic commerce websites try tostrike a balance by producing either highly precise search results withlow recall (many relevant products are not returned) or imprecise searchresults with high recall (many non-relevant products are returned). Theformer approach may cause an online shopper to believe that the productis not available for sale on the merchant's electronic commerce website.The latter may result in a poor user experience for an online shopperbecause the online shopper may have to browse through irrelevantproducts to locate a desired product. The high recall approach may bemitigated by sorting the search results in the order of decreasingrelevancy, however this still does not provide a satisfactory userexperience. For example, on a website that provides faceted navigationof search results, an online shopper may be confused if a selectablefacet feature contains an attribute value that is related to irrelevantproducts.

In general, it is difficult to configure a balanced search strategyusing a single search pass because the search process is highlydependent on the keyword search terms that the online shopper uses. Amultiple search pass approach would allow an electronic commerce websiteto attempt multiple search strategies in response to a single searchquery from an online shopper to optimize the precision and recall of thesearch results. Accordingly, various exemplary embodiments of thepresent invention are directed to systems and methods for implementing asearch engine platform adaptable for an electronic commerce website, orother types of searchable electronic documents, that can performmultiple search passes using different search strategies in response toa single search query to obtain improved precision and recall of thesearch results that are returned to the online shopper, or other typesof users. In at least one exemplary embodiment, a multiple pass searchmay comprise a sequence of search passes wherein the search strategy ofthe first search is very precise and the search strategy of eachsuccessive search pass in the sequence of search passes becomesprogressively less precise. Moreover, in at least one exemplaryembodiment, a multiple pass search may comprise a conditional sequenceof search passes wherein the specific sequence flow of search passes inresponse to a search query is determined based on transitional rules andon the search results of one or more prior search passes.

The various exemplary embodiments of the present invention describedherein may be implemented using one or more computer systems includingone or more processors, one or more memory devices, one or morecommunication interfaces, and one or more persistent storage devices,including, one or more non-transitory computer readable media includingcomputer-readable code containing instructions for the one or moreprocessors to perform processing steps. The one or more computer systemsmay form part of a network, such as a local area network or a wide areanetwork, such as, for example, the Internet. In exemplary embodiments,the one or more computer systems may include standard hardwarecomponents and/or specialized hardware components.

The systems and methods of the present invention may be operated as partof a system for electronic commerce comprising one or more user devicesthat interact through a network with one or more merchant servers thatoffer goods for sale via a web page or electronic application. Referringto FIG. 1, search queries generated by online shoppers from one or moreuser devices 10, such as tablets, smartphones, or computers, connectedthrough a network, such as the Internet 15, may be transmitted to one ormore merchant servers 40 which, in turn may transmit the search querythrough the network to one or more multiple pass search engine servers20. One or more administrator devices 30, connected through the networkto one or more merchant servers or one or more multiple pass searchengine servers, may be used for configuring such servers. In otherembodiments, one or more of the functions of each of these devices andservers may be combined into a single server, and/or divided up amongone or more other servers performing duplicate and/or portions of thefunctions.

Referring to FIG. 1, a multiple pass search engine server may contain aquery interface module 210 to receive search queries and to transmitsearch results; a multiple pass search controller module 230 to manage amultiple pass search algorithm, and a basic search engine module 250 toexecute a search using a particular search strategy and return results.

In exemplary embodiments, a basic search engine module 250 may be a fulltext search engine that facilitates searching using a searchable keywordindex. An index may consist of one or more documents and a document mayconsist of one or more searchable fields. For example, in connectionwith an electronic commerce application, a document may correspond to aparticular product sold by a merchant and each field of a document maycorrespond to a certain attribute of the product, e.g., brand, size,color, type, etc. that can be independently searched.

Each search executed by the basic search engine module 250 is referredto as a search pass. A multiple pass search is a plurality of individualsearch passes that are executed in sequence. The particular sequence ofsearch passes in a multiple pass search may be dependent on the searchresults or search metadata of a search pass. Each search pass mayterminate a search and return results or transition to one of one ormore search passes. These conditional sequences of search passes, i.e.,conditional search flows, result in a multiple pass search pipeline.

As shown in FIG. 2, according to an exemplary embodiment, a multiplepass search algorithm may be represented by a multiple pass searchpipeline. The arrows indicate the possible transitions and the executionorder of the search passes. The transitions between search passes in themultiple pass search sequence are governed by transition rules andconditions associated with each search pass. The transition rules definethe possible transitions from the search pass and the thresholdconditions for the transitions to occur.

Referring to FIG. 1, a multiple pass search controller module 230interacts with the basic search engine module 250 to manage theexecution of search passes. The multiple pass search controller module230 initiates a search pass, examines the search results and/or searchmetadata (e.g., number of results, query length, etc.) in view of thecorresponding transition rules and conditions and determines whether toterminate the search and return the search results or continue thesearch and determine to which search pass to transition. For example, atransition rule may require a minimum number of matches as a transitioncondition for a particular transition path. All or some of the searchresults and/or search metadata may be stored in memory and used in asubsequent search pass.

Each search pass may have its own search configuration associated with aparticular search strategy. For example, each search pass may have itsown search type (e.g., e.g., PATTERN search, as discussed in aco-pending patent application, (Atty. Dkt. No. 33765/1228) the contentsof which are incorporated herein by reference in their entirety, andmatch strategy as part of its search configuration. Referring to FIG. 6,there are several types of match strategies that can be implemented in asearch pass, as organized along two axes in the illustration. The axesrelate to where unmatched terms are allowed either in the query and/orin the document fields. Each quadrant defines a match strategy: exactmatch, all match, best partial match, and partial match. For an exactmatch, all query terms are matched and there are no extra terms in thematching field. For a partial match, some of the query terms are matchedand there are extra terms in the matching field.

Specifically, FIG. 2 shows a high level flow chart illustrating aparticular multiple pass search algorithm for handling a search query bya multiple pass search controller module 250. In step S01 of the method,a keyword search query is received. In step S03, a search pass forproduct identification numbers is performed. This includes determiningwhether the search query contains a product identification number or auniversal product code (UPC) number in an acceptable format and, if so,performing a search only in the product identification number searchfield. In step S05, the transition rule associated with the search passis applied. In particular, it is determined whether the transitioncondition of having at least one product identification number match ismet. If the condition is met, the process proceeds to step S27, wherethe search results are transmitted and the process ends. Otherwise, thesearch flow transitions to the next search pass in step S07.

In step S07, a search pass for exact matches in a particular combinationof fields associated with a product, such as brand, color, product type,gender, category, etc., is performed. For example, if the selectedfields were brand, color, and product type and the query consisted of“blue”, “calvin”, “klein”, and “jeans”, only products having thefollowing field values BRAND: “calvin klein”, COLOR: “blue”, andPRODUCT_TYPE: “jeans” without additional terms in those fields would beconsidered exactly matching. When there is a match in a particularfield, the associated search parameter may be saved as an implicitrefinement for another search pass. An implicit refinement is a specificvalue (or several values for a multi-valued field) of a specific fieldwhich matches a part of the search query and has at least one matchingsearch result. For example, a search query “cute donna karan jeans” mayimply two refinements: BRAND=DKNY and PRODUCT_TYPE=jeans.

In general, implicit refinements are implicit search constraints thatmay be determined from the search query and indexed field values andapplied by the multiple pass search controller module 230 duringexecution of a search pass or they may be determined and collected bythe multiple pass search controller 230 during execution of a searchpass and saved for application in one or more subsequent search passes.Each search pass may generate one or more implicit refinements. Thecollection of implicit refinements is optional.

The collected implicit refinements may be stored as search context. Asearch context is data shared between multiple search passes, such as,search results, implicit refinements, list of actions taken (spellingautocorrect, cross-field matches, etc.) or other search metadata. Searchcontext is stored by the multiple pass search controller module 230.

In step S09, the associated transition rule is applied. In particular,it is determined whether the transition condition of having at least oneexact match is met. If the condition is met, the search flow transitionsto the search pass in step S11, otherwise the search flow transitions tothe alternative search pass in step S15.

In step S11, an exhaustive search pass searching all documents in theindex for exact matches against all the implicit refinements collectedin step S07 is invoked. In step S13, the associated transition rule isapplied. In particular, it is determined whether the transitioncondition of having at least one document matching all implicitrefinements is met. If there is at least one match the process proceedsto step S27, otherwise the search flow transitions to the next searchpass in step S15.

In step S15, a search pass for matching all terms in the search query inany combination of fields is performed. In step S17, the associatedtransition rule is applied. According to the transition rule of stepS17, there are three potential transitions each having its owntransition condition that determines whether the flow path is used. Thetransition conditions are mutually exclusive because only one flow pathmay be selected. In at least one exemplary embodiment, the search flowpath to be taken depends on the type of match. Specifically, it isdetermined whether there are no matches, all documents were matched thesame way (unambiguous match), or there are multiple sets of implicitrefinements, indicating that some documents were matched in waysdifferent from some other documents. If there is an unambiguous match,the transition rule indicates that there is no further transition so thesearch ends and the results are returned. If there is an ambiguousmatch, the search flow transitions to the search pass in step S21. Ifthere is no match, the search flow transitions to the search pass instep S19.

In step S19, a search pass involving a conventional tokenized textsearch for matching any query term in any order in any field isperformed. The search ends and any results are returned because theassociated transition rule indicates that there is no further searchpass.

In step S21, a search pass for matching all search query terms in anyfield and with the automatic spelling correction filter enabled isperformed. According to the associated transition rule in step S23, ifthere are more than 10 matches the search ends and the results arereturned. If there are less than 10 matches, an indication to save theresults for merging with the results of the next search pass is storedas search context information and the search flow transitions to thenext search pass in step S25. In step S25, a search pass for partiallymatching any search query terms in any field is performed. Because theassociated transition rule does not specify any additional transitions,the search ends and any results are merged with the results of the priorsearch pass and returned.

As shown in FIG. 2, the specific search flow may be dependent on thesearch query, the search results, search metadata, and the transitionrules and conditions. In exemplary embodiments, the scope of each searchpass may broaden with each successive search pass until a thresholdnumber of relevant search results are found. For example, in theexemplary multiple pass search algorithm shown in FIG. 2, the firstsearch pass is limited to product identification numbers, the next twosearches are limited to exact matches, and the subsequent search allowsextra unmatched terms in the field.

Referring to FIG. 3, a flow chart of a general multiple pass searchalgorithm for a multiple pass search controller module is illustrated.In step S101, the multiple pass search controller module receives asearch query. In step S103, the multiple pass search controller moduledetermines which search pass to attempt first. In at least one exemplaryembodiment, the multiple pass search controller module may refer to aconfiguration file. Additionally, in at least one exemplary embodiment,the first search pass may be the same for all queries.

In step S105, the multiple pass search controller module 230 interfaceswith the basic search engine module 250 to execute the search pass. Inat least one exemplary embodiment, the interface is an API that permitsthe multiple pass search controller module 230 to make search requestsand pass parameters to the basic search engine module 250. Otherinterfaces, such as the conventional HTTP internet interface may beused.

In step S107, the multiple pass search controller module 230 maydetermine whether the current search results should be discarded orsaved and/or merged with the results of another search pass. The searchcontext is updated to indicate any actions that may be performed on thesearch results, e.g., whether results should be saved to be merged withthe results of the subsequent search pass. Further, the multiple searchpass controller module 230 may detect and apply implicit refinements tothe search results or collect and store implicit refinements in thesearch context for subsequent use. Additionally, the multiple searchpass controller module 230 may determine context information from areceived search query and use that information to help filter the searchresults. For example, the geographic location of the online shopper canbe determined based on the Internet Protocol address from which thesearch query originated and this information may be used to limit thesearch results to products available for shipping to the identifiedgeographic location. In general, such context filters, are implicitsearch constraints that may be determined from the search meta data andapplied by the multiple pass search controller module 230 to filtersearch results of a search pass.

In step 109, the multiple pass search controller module may useinformation stored in the search context, the results returned from thebasic search engine module 250, and the transition rule and conditionsassociated with the search pass to determine whether to end the searchand return the results or which search pass to transition to next.

Preferably, the multiple pass search flow pipeline is configurable,i.e., the search passes can be configured and/or searches passes may beadded or removed to form different combinations of search flows. In atleast one exemplary embodiment, the logical structure of the multiplepass search algorithm may be defined in a configuration file, such as,for example an XML file. For example, the administrator may instruct theprogram to reread a configuration file once it is created or modifiedand apply changes to the current search process. This allows the searchalgorithm to be modified or a new algorithm to be created without theneed to rewrite the program code. The configuration file may define oneor more search flows each including a sequence of one or more searchpasses, including the rules and conditions governing the transition fromone search pass to another. The configuration file may also define thesearch configuration for each individual search pass.

Referring again to FIG. 1, a configuration module 240 may execute themethod illustrated in FIG. 4 to configure a conditional search flowpipeline representing a multiple pass search algorithm. Theconfiguration information may be received from a configuration interfacemodule 220 connected through a network, such as Internet 15, to anadministrator device 30 via a web browser application interface or aproprietary user interface. The configuration information may include:configuration parameters for a search pass (e.g., search strategy),indication of the subsequent search passes to which the current searchpass may transition, and the associated transition rules and conditionsfor each potential transition. FIG. 4 shows an overview of how aconditional search flow pipeline may be created or modified using aconfiguration file. Particularly, FIG. 4 shows how a search pass can beadded to a conditional search flow pipeline. In step S201, a new searchpass entry is added as a new entry in a configuration file. In stepS203, configuration parameters for the search pass entry are receivedand stored in the corresponding entry in the configuration file. FIG. 5shows this step in greater detail. In step S205, indication of the oneor more search passes to which the search pass entry may transition isstored. If none are indicated, the parameter in the configuration fileis left blank. This signifies that the search pass entry is the lastsearch pass in a search flow and results should be returned. In stepS207, for each transition path specified in step S205, the transitionconditions associated with the particular transition are storedrespectively. In particular, transition conditions may include meeting athreshold number of search results, whether implicit refinements havebeen applied, whether a particular type of match is satisfied, etc.Multiple transition conditions may be specified for a particulartransition. When multiple transition conditions are specified, alltransition conditions must be satisfied for the transition to occur. Atransition rule may also determine whether search results should bereturned to the online shopper, whether current search results should bediscarded and another search should be attempted, or whether currentsearch results should be merged with results of the next search pass.

At step S209, steps S201 through S207 of the process are repeated untilconfiguration information for each search pass in the conditional searchflow pipeline of a multiple search pass algorithm is stored in theconfiguration file.

Referring to FIG. 5, in exemplary embodiments, each search pass may beconfigured. FIG. 5 shows an overview of how a search strategy of asearch pass may be configured. In step S301, general configurationparameters for a search pass are received and stored in theconfiguration file. In particular, general configuration parameters fora search pass may include, for example, the search type, match type,maximum query length, minimum number of fields that must be matched,etc. Additionally, plug-in and/or extension modules for a search passmay also be received through the configuration interface module 220 andstored in the configuration module 240 if the basic search engine module250 supports plugin architecture. For example, an administrator mayprovide different normalization algorithms to be used in addition orinstead of the default normalization algorithms (e.g., stemming,spelling correction). Normalization algorithms include filters that maybe applied to text to generate a standard set of index/query terms forpurposes of index/query building by the search engine. In step S303,identification of the set of fields that must be searched are receivedand stored. In step S305, parameters specific to each field identifiedin step S303, are received and stored. In particular, field specificconfiguration parameters may include, for example, match type, orderedlist of normalization algorithms, relevancy boost, etc.

Table 1 shows an exemplary list of the general and field specific searchparameters that may be part of a configuration file.

Description General Search Parameters field set set of designated fieldssearch_type e.g., pattern search or text search maxWords maximum inputquery length maxOmitWords maximum number of unmatched words in thesearch query minFieldsMatch minimum number of fields from the field setwhich must be matched maxFieldsMatch maximum number of fields from thefield set which must be matched multiMatch boolean parameter thatcontrols whether a field may be matched several times to different partsof the query refineByImplicit instructs application of ImplicitRefinements accumulated so far by the previous search passes in thesearch context as additional filters to the search query Field SpecificParameters match_type e.g., COMPLETE: requires that there is a completematch between a phrase from the query partition and a field value;INCOMPLETE: requires that the field value contains the phrase from thequery partition, but allows the field value to have unmatched terms;match_strategy e.g., defines a specific INCOMPLETE match_type algorithmfor a particular field must_match e.g., boolean parameter that controlswhether a particular field must be matched collectRefinements e.g.,boolean parameter that controls whether implicit refinements should becollected for a particular field stemming_mode e.g., NONE; disablesstemming; DEFAULT: applies the system wide stemming algorithm to theparticular field spellingAccuracy e.g., integer percentage valueindicating sensitivity of spell correction for the particular field

By using the configuration parameters to create different searchstrategies for each search pass, administrators of an electroniccommerce website can implement a multiple pass search that begins withthe order of decreasing precision, i.e., if the recall of a highprecision search pass is satisfactory based on certain metricsconfigured by the administrator, the result is returned to the customer.If the recall of a high precision search pass is not satisfactory,subsequent passes each successively lower in precision are attempted.

Preferably, the multiple pass search engine platform employs a modulardesign to take advantage of available third party software. In at leastone exemplary embodiment, as shown in FIG. 1, the multiple pass searchcontroller module 230 is implemented as web application module thatinteracts with a typical search platform, for example, such asSolr/Lucene, Endeca, etc., which are standalone full text searchservers. A general full text search server performs a single search passwith configurable steps, such as linguistic analyzers, matchingstrategies, ranking strategies, etc.

Now that embodiments of the present invention have been shown anddescribed in detail, various modifications and improvements thereon canbecome readily apparent to those skilled in the art. Accordingly, theexemplary embodiments of the present invention, as set forth above, areintended to be illustrative, not limiting. The spirit and scope of thepresent invention is to be construed broadly.

What is claimed is:
 1. A method comprising the steps of: receiving,using one or more processors, a search query containing search terms;executing, using one or more processors, a first search pass of aconditional search flow pipeline according to a first search passconfiguration in response to the received search query; generating,using one or more processors, search results and associated informationbased on the executed first search pass; storing, using one or moreprocessors, the search results and associated information obtained fromthe execution of the first search pass as search context information;determining, using one or more processors, which search pass of theconditional search flow pipeline should be executed as a second searchpass based on a transition rule associated with the first search passand the search context information; executing, using one or moreprocessors, the second search pass of the conditional search flowpipeline according to a second search pass configuration in response tothe received search query; generating, using one or more processors,additional search results and associated information based on theexecuted second search pass; updating, using one or more processors, thesearch context information based on the additional search results andassociated information obtained from the execution of the second searchpass; and determining, using one or more processors, whether to provideupdated search results in the updated search context information orproceed to another search pass of the conditional search flow pipelinebased on a transition rule associated with the second search pass andthe updated search context information.
 2. The method of claim 1,wherein the search context information comprises one or more implicitrefinement constraints.
 3. The method of claim 2, further comprising thestep of applying one or more implicit refinement constraints duringexecution of the first or second search pass.
 4. The method of claim 1,wherein the step of updating the search context information is furtherbased on the transition rule associated with the first search pass. 5.The method of claim 1, wherein the step of updating the search contextinformation comprises storing the additional search results generated bythe second search pass.
 6. The method of claim 5, wherein the step ofupdating the search context information comprises discarding the searchresults generated by the first search pass.
 7. A method comprising thesteps of: receiving, using one or more processors, configurationparameters for one or more electronic search passes; receiving, usingone or more processors, parameters related to transition rules for theone or more electronic search passes; storing, using one or moreprocessors, the configuration parameters and the parameters related tothe transition rules for the one or more electronic search passes in aconfiguration file; generating, using one or more processors, aconditional search flow pipeline from the configuration file to beexecuted by an electronic search engine module.
 8. The method of claim7, wherein the configuration parameters comprise indication of whetherimplicit refinements should be applied.
 9. The method of claim 7,wherein the parameters related to a transition rule compriseidentification of a transition path and one or more transitionconditions associated with the transition path.
 10. The method of claim7, wherein the parameters related to a transition rule compriseindication of whether search results of an electronic search pass shouldbe merged into or replaced by search results of another electronicsearch pass.
 11. A system comprising: at least one processor; at leastone non-transitory processor readable medium operatively connected to atleast one processor, the at least one processor readable medium havingprocessor readable instructions executable by the at least one processorto perform the following method: receiving, using one or moreprocessors, a search query containing search terms; executing, using oneor more processors, a first search pass of a conditional search flowpipeline according to a first search pass configuration in response tothe received search query; generating, using one or more processors,search results and associated information based on the executed firstsearch pass; storing, using one or more processors, the search resultsand associated information obtained from the execution of the firstsearch pass as search context information; determining, using one ormore processors, which search pass of the conditional search flowpipeline should be executed as a second search pass based on atransition rule associated with the first search pass and the searchcontext information; executing, using one or more processors, the secondsearch pass of the conditional search flow pipeline according to asecond search pass configuration in response to the received searchquery; generating, using one or more processors, additional searchresults and associated information based on the executed second searchpass; updating, using one or more processors, the search contextinformation based on the additional search results and associatedinformation obtained from the execution of the second search pass; anddetermining, using one or more processors, whether to provide updatedsearch results in the updated search context information or proceed toanother search pass of the conditional search flow pipeline based on atransition rule associated with the second search pass and the updatedsearch context information.
 12. The system of claim 11, wherein thesearch context information comprises one or more implicit refinementconstraints.
 13. The system of claim 12, wherein the at least oneprocessor further performs the step of applying one or more implicitrefinement constraints during execution of the first or second searchpass.
 14. The system of claim 11, wherein the step of updating thesearch context information is further based on the transition ruleassociated with the first search pass.
 15. The method of claim 11,wherein the step of updating the search context information comprisesstoring the additional search results generated by the second searchpass.
 16. The method of claim 15, wherein the step of updating thesearch context information comprises discarding the search resultsgenerated by the first search pass.
 17. A system comprising: at leastone processor; at least one non-transitory processor readable mediumoperatively connected to at least one processor, the at least oneprocessor readable medium having processor readable instructionsexecutable by the at least one processor to perform the followingmethod: receiving, using one or more processors, configurationparameters for one or more electronic search passes; receiving, usingone or more processors, parameters related to transition rules for theone or more electronic search passes; storing, using one or moreprocessors, the configuration parameters and the parameters related tothe transition rules for the one or more electronic search passes in aconfiguration file; generating, using one or more processors, aconditional search flow pipeline from the configuration file to beexecuted by an electronic search engine module.
 18. The system of claim17, wherein the configuration parameters comprise indication of whetherimplicit refinements should be applied.
 19. The system of claim 17,wherein the parameters related to a transition rule compriseidentification of a transition path and one or more transitionconditions associated with the transition path.
 20. The method of claim17, wherein the parameters related to a transition rule compriseindication of whether search results of an electronic search pass shouldbe merged into or replaced by search results of another electronicsearch pass.